Line graphs of bipartite graphs with Hamiltonian paths

It is shown that, if t is an integer ≥3 and not equal to 7 or 8, then there is a unique maximal graph having the path P_t as a star complement for the eigenvalue ?2. The maximal graph is the line graph of K_m,m if t = 2m?1, and of K_m,m+1 if t = 2m. This result yields a characterization of L(G ) when G is a (t + 1)‐vertex bipartite graph with a Hamiltonian path. The graphs with star complement P_r ∪ P_s or P_r ∪ C_s for ?2 are also determined. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 137–149, 2003     

Order restricted randomized designs for control versus treatment comparison

We develop a method of randomizing units to treatments that relies on subjective judgement or on possible coarse modeling to produce restrictions on the randomization. The procedure thus fits within the general framework of ranked set sampling. However, instead of selecting a single unit from each set for full measurement, all units within a set are used. The units within a set are assigned to different treatments. Such an assignment translates the positive dependence among units within a set into a reduction in variation of contrasting features of the treatments. A test for treatment versus control comparison, with controlled familywise error rate, is developed along with the associated confidence intervals. The new procedure is shown to be superior to corresponding procedures based on completely randomized or ranked set sample designs. The superiority appears both in asymptotic relative efficiency and in power for finite sample sizes. Importantly, this test does not rely on perfect rankings; rather, the information in the data on the quality of rankings is exploited to maintain the level of the test when rankings are imperfect. The asymptotic relative efficiency of the test is not affected by estimation of the quality of rankings, and the finite sample performance is only mildly affected.     

基因组重排问题的一个近似算法

分子生物学中基因无方向的反向基因组重排问题在数学上已被证明是一个NP困难问题．基于断点图的概念，给出一个时间复杂性为O(max{b^(π)，nb(π)})，空间复杂性为0(n)的求其近似最优解的算法．其中n为基因组中基因个数，π=(π1,π2，…，πn)表示n个基因的一种排列，b(π)表示排列π中的断点数．数据实验的结果表明，该近似算法可以求得较好的结果．     

障碍拟阵图

Let G be a simple graph and T={S :S is extreme in G}. If M(V(G), T) is a matroid, then G is called an extreme matroid graph. In this paper, we study the properties of extreme matroid graph.     

数码相机CMOS图像传感器的特性参数与选择

介绍了数码相机的核心器件———CMOS图像传感器的特性参数和在数码相机设计过程中CMOS图像传感器的选择。选择CMOS图像传感器,不仅需要考虑包括传感器的尺寸、像素总数和有效像素数、最小照度、动态范围、灵敏度、分辨力、光电响应不均匀性以及光谱响应等在内的特性参数,而且还要考虑电源管理和功耗、模数转换位数、开发的简便性以及成本等因素。     

Robust handling of non‐linear constraints for GA optimization of aerodynamic shapes

A new approach to the robust handling of non‐linear constraints for GAs (genetic algorithms) optimization is proposed. A specific feature of the approach consists of the change in the conventional search strategy by employing search paths which pass through both feasible and infeasible points (contrary to the traditional approach where only feasible points may be included in a path). The method (driven by full Navier–Stokes computations) was applied to the problem of multiobjective optimization of aerodynamic shapes subject to various geometrical and aerodynamic constraints. The results demonstrated that the method retains high robustness of conventional GAs while keeping CFD computational volume to an acceptable level, which allowed the algorithm to be used in a demanding engineering environment. Copyright © 2004 John Wiley & Sons, Ltd.     

Geometrical Molecular Structure Design Concept in Approach to Homo- and Heterometallic Precursors of Advanced Materials in Sol–Gel Technology

The article describes the principles of the Single Source Precursor approach to inorganic materials and introduces the Geometrical Molecular Structure Design Concept (MSDC) based on the choice of a proper molecular structure type for the desired precursor and completing it with ligands providing both the necessary number of donor atoms and the sterical protection of the chosen core. Application of MSDC is illustrated with examples taken from development of new approaches in the synthesis of oxide and sulfide catalysts and ferroelectric oxide materials.     

一种微型空调器的优化设计

介绍了一种微型空调器的研制背景及设计方案 ,采用仿真优化的设计手段对空调器的制冷、制热系统进行了优化设计 ,实践证明其设计是成功的。同时说明了该型空调器所具有的特点及应用场合     

爆炸焊接参数的计算机辅助设计

 根据爆炸焊接理论，综合分析了相关爆炸焊接参数的计算方法，利用Visual C++语言编制了爆炸焊接参数计算机辅助设计程序，该程序采用菜单和视图形式对输入、输出命令结果进行操作，方便直观。与有关实验结果的对比表明，计算所给出的焊接窗口及最佳焊接参数具有很高的准确度。爆炸焊接CAD方法对于减少实验次数，摆脱经验设计方法，选择最佳焊接参数将是非常有用的工具。     

Explicit 2-Factorisations of the Odd Graph

In this note we show how 1-factors in the middle two layers of the discrete cube can be used to construct 2-factors in the Odd graph (the Kneser graph of (k − 1)-sets from a (2k − 1)-set). In particular, we use the lexical matchings of Kierstead and Trotter, and the modular matchings of Duffus, Kierstead and Snevily, to give explicit constructions of two different 2-factorisations of the Odd graph. This revised version was published online in September 2006 with corrections to the Cover Date.